Deductive databases and P systems
نویسندگان
چکیده
In computational processes based on backwards chaining, a rule of the type A ← B1, . . . , Bn is seen as a procedure which points that the problem A can be split into the problems B1, . . . , Bn. In classical devices, the subproblems B1, . . . , Bn are solved sequentially. In this paper we present some questions that circulated during the Second Brainstorming Week related to the application of the parallelism of P systems to computation based on backwards chaining, and we illustrate them with the example of inferential deductive process.
منابع مشابه
Deductive Databases - Theory Meets Practice
Deductive Databases are coming of age with the emergence of efficient and easy to use systems that support queries, reasoning, and application development on databases through declarative logic-based languages. Building on solid theoretical foundations, the field has benefited in the recent years form dramatic advances in the enabling technology. This progress is demonstrated by the completion ...
متن کاملA Parallel Algorithm for the Generalized Partially Instantiated Same Generation Query in Deductive Databases
The expressive power and intelligence of traditional database systems can be improved by recursion. Using recursion, relational database systems are extended into knowledge-base systems (deductive database systems). Linear recursion is the most frequently found type of recursion in deductive databases. Deductive databases queries are computationally intensive and lend themselves naturally to pa...
متن کاملManaging Open Systems Now that the Glass-house Has Gone
Knowledge reuse through networks of large KBS p. 13 Expressing temporal behaviour with extended ECA rules p. 23 Temporal databases: an event-oriented approach p. 38 Object comprehensions: a query notation for object-oriented databases p. 55 Expressivity of typed logic paradigms for object-oriented databases p. 73 Algebraic computation of the weak well-founded model for general deductive databas...
متن کاملRules in Database Systems
This paper deals with the principles of rule-based systems in databases and gives an overview of existing approaches. First, we introduce the concept of rules. The application of rule-based systems to databases is categorized. Deductive database systems are introduced as the first extension of classical database management systems. We briefly describe the concept of deductive databases and thei...
متن کاملVI_SDB: a convivial approach for description and manipulation of deductive and stratified databases
Although deductive databases is based on a well established formalism, they didn't know the expected success. Their use was limited to the academic purpose. Indeed, the deductive database management systems are judged abstract, rare in commercial offers, and often expensive. In among the abstract concepts of the deductive databases, we mention the case of the negation and its treatment by the s...
متن کاملMontague Grammars as Deductive Databases
This paper presents a technique for further applications of deductive databases in the eld of natural language processing. Although there were enormous research eeorts on analyzing the semantics of natural languages (NL), especially using Montague grammars (PTQ) for Prolog, corresponding programs for deductive databases are still missing, since range restriction is required in nearly all deduct...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- The Computer Science Journal of Moldova
دوره 12 شماره
صفحات -
تاریخ انتشار 2004